Primal-Dual Symmetric Intrinsic Methods for Finding Antiderivatives of Cyclically Monotone Operators

نویسندگان

  • Heinz H. Bauschke
  • Yves Lucet
  • Xianfu Wang
چکیده

A fundamental result due to Rockafellar states that every cyclically monotone operatorA admits an antiderivative f in the sense that the graph ofA is contained in the graph of the subdifferential operator ∂f . Given a method m that assigns every finite cyclically monotone operator A some antiderivative mA, we say that the method is primal-dual symmetric if m applied to the inverse of A produces the Fenchel conjugate of mA. Rockafellar’s antiderivatives do not possess this property. Utilizing Fitzpatrick functions and the proximal average, we present novel primal-dual symmetric intrinsic methods. The antiderivatives produced by these methods provide a solution to a problem posed by Rockafellar in 2005. The results leading to this solution are illustrated by various examples. 2000 Mathematics Subject Classification: Primary 47H05; Secondary 26B25, 52A41, 90C25.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A primal-dual splitting algorithm for finding zeros of sums of maximally monotone operators

We consider the primal problem of finding the zeros of the sum of a maximally monotone operator with the composition of another maximally monotone operator with a linear continuous operator and a corresponding dual problem formulated by means of the inverse operators. A primal-dual splitting algorithm which simultaneously solves the two problems in finite-dimensional spaces is presented. The sc...

متن کامل

Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Determinist...

متن کامل

2 7 N ov 2 01 5 Asynchronous Block - Iterative Primal - Dual Decomposition Methods for Monotone Inclusions ∗

We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the sense that, at each iteration, only a subset of the monotone operators needs to be processed, as opposed to all operators as in established methods. Determinist...

متن کامل

A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators

We consider the primal problem of finding the zeros of the sum of a maximal monotone operator and the composition of another maximal monotone operator with a linear continuous operator. By formulating its Attouch-Théra-type dual inclusion problem, a primal-dual splitting algorithm which simultaneously solves the two problems in finitedimensional spaces is presented. The proposed scheme uses at ...

متن کامل

A Douglas-Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators

In this paper we propose two different primal-dual splitting algorithms for solving inclusions involving mixtures of composite and parallel-sum type monotone operators which rely on an inexact Douglas-Rachford splitting method, however applied in different underlying Hilbert spaces. Most importantly, the algorithms allow to process the bounded linear operators and the set-valued operators occur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Control and Optimization

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2007